Unfolding partiality and disjunctions in stable model semantics
نویسندگان
چکیده
منابع مشابه
Eliminating Disjunctions in Answer Set Programming by Restricted Unfolding
A disjunctive logic program under the answer set semantics can be equivalently translated to a normal logic program by the shifting transformation, if the program is head-cycle-free. In this paper, we provide an answer-set-preserving rewriting of a general disjunctive program to a normal program by first applying the unfolding transformation on atoms that prevent the program from being headcycl...
متن کاملOn Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge representation and reasoning. However, disjunction is often not really needed, in that an equivalent program without disjunction can be given. In this paper, we consider the question, given a disjunctive logic program, P ,...
متن کاملExtending and Implementing the Stable Model Semantics
An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of e cient implementation techniques. In particular, an implementation of lookahead that safely avoids testing every literal for failure and that makes the use of look...
متن کاملAsserting Lemmas in the Stable Model Semantics
From a logic programming point of view, the stable model semantics for normal programs has the problem that logical consequences of programs cannot, in general, be stored as lemmas. This is because the set of stable models of the resulting program may change. In fact, logical consequence under the stable model semantics does not enjoy an important property required of non–monotonic entailment r...
متن کاملStable model semantics for founded bounds
Answer Set Programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics, which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving problems involving cyclic dependencies between multiple integer or continuous quantities effective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2006
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1119439.1119440